A fast method to diagonalize a Hankel matrix
نویسندگان
چکیده
منابع مشابه
Calculation of One-dimensional Forward Modelling of Helicopter-borne Electromagnetic Data and a Sensitivity Matrix Using Fast Hankel Transforms
The helicopter-borne electromagnetic (HEM) frequency-domain exploration method is an airborne electromagnetic (AEM) technique that is widely used for vast and rough areas for resistivity imaging. The vast amount of digitized data flowing from the HEM method requires an efficient and accurate inversion algorithm. Generally, the inverse modelling of HEM data in the first step requires a precise a...
متن کاملdesigning a fast locking pll
a phase-locked loop (pll) based frequency synthesizer is an important circuit that is used in many applications, especially in communication systems such as ethernet receivers, disk drive read/write channels, digital mobile receivers, high-speed memory interfaces, system clock recovery and wireless communication system. other than requiring good signal purity such as low phase noise and low spu...
Using Complex-Orthogonal Transformations to Diagonalize a Complex Symmetric Matrix
In this paper, we propose the use of complex-orthogonal transformations for nding the eigenvalues of a complex symmetric matrix. Using these special transformations can signiicantly reduce computational costs because the tridiagonal structure of a complex symmetric matrix is maintained.
متن کاملOn fast matrix-vector multiplication with a Hankel matrix in multiprecision arithmetics
We present two fast algorithms for matrix-vector multiplication y = Ax, where A is a Hankel matrix. The current asymptotically fastest method is based on the Fast Fourier Transform (FFT), however in multiprecision arithmetics with very high accuracy FFT method is actually slower than schoolbook multiplication for matrix sizes up to n = 8000. One method presented is based on a decomposition of m...
متن کاملAnalysis of a Fast Hankel Eigenvalue Algorithm
This paper analyzes the important steps of an O(n 2 log n) algorithm for nding the eigenvalues of a complex Hankel matrix. The three key steps are a Lanczos-type tridiagonalization algorithm, a fast FFT-based Hankel matrix-vector product procedure, and a QR eigenvalue method based on complex-orthogonal transformations. In this paper, we present an error analysis of the three steps, as well as r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1998
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(98)10101-5